Piecewise-Linear Approximations of Multidimensional Functions
نویسندگان
چکیده
منابع مشابه
Piecewise-Linear Approximations of Uncertain Functions
We study the problem of approximating a function F : R→ R by a piecewise-linear function F when the values of F at {x1, . . . , xn} are given by a discrete probability distribution. Thus, for each xi we are given a discrete set yi,1, . . . , yi,mi of possible function values with associated probabilities pi,j such that Pr[F(xi) = yi,j ] = pi,j . We define the error of F as error(F,F) = maxi=1 E...
متن کاملDiscrete piecewise linear functions
The concept of permutograph is introduced and properties of integral functions on permutographs are established. The central result characterizes the class of integral functions that are representable as lattice polynomials. This result is used to establish lattice polynomial representations of piecewise linear functions on R and continuous selectors on linear orders.
متن کاملInvertible Piecewise Linear Approximations for Color Reproduction
We consider the use of linear splines with variable knots for the approximation of unknown functions from data , motivated by control and estimation problems arising in color systems management. Unlike most popular nonlinear-in-parameters representations, piecewise linear (PL) functions can be simply inverted in closed form. For the one-dimensional case, we present a study comparing P L and neu...
متن کاملFitting piecewise linear continuous functions
We consider the problem of fitting a continuous piecewise linear function to a finite set of data points, modeled as a mathematical program with convex objective. We review some fitting problems that can be modeled as convex programs, and then introduce mixed-binary generalizations that allow variability in the regions defining the best-fit function’s domain. We also study the additional constr...
متن کاملCorrelation between Piecewise - Linear Functions ∗
We study the problem of computing correlation between two piecewise-linear bivariate functions defined over a common domain, where the surfaces they define in three dimensions— polyhedral terrains—can be transformed vertically by a linear transformation of the third coordinate (scaling and translation). We present a randomized algorithm that minimizes the maximum vertical distance between the g...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Optimization Theory and Applications
سال: 2009
ISSN: 0022-3239,1573-2878
DOI: 10.1007/s10957-009-9626-0